Flexible Query Answering Using Distance-Based Fuzzy Relations
نویسندگان
چکیده
This paper addresses the added value that is provided by using distance-based fuzzy relations in flexible query answering. To use distances and/or concepts of gradual similarity in that domain is not new. Within the last ten years, however, results in the theory of fuzzy relations have emerged that permit a smooth and pragmatic, yet expressive and effective, integration of ordinal concepts too. So this paper primarily highlights the benefits of integrating fuzzy orderings in flexible query answering systems, where the smooth interplay of fuzzy equivalence relations and fuzzy orderings allows to use simple distances as a common basis for defining both types of relations. As one case study, we discuss a pragmatic variant of a flexible query answering system—the so-called Vague Query System (VQS). The integration of fuzzy orderings into that system is provided in full detail along with the necessary methodological background and demonstrative examples.
منابع مشابه
Bousi~Prolog: a Prolog Extension Language for Flexible Query Answering
In this paper we present the main features an implementation details of a programming language that we call Bousi∼Prolog. It can be seen as an extension of Prolog able to deal with similarity-based fuzzy unification (“Bousi” is the Spanish acronym for “fuzzy unification by similarity”). The main goal is the implementation of a declarative programming language well suited for flexible query answ...
متن کاملCompositions de relations d'ordre sur des quantités graduelles et expression de requêtes flexibles
An issue in extending databases is to increase the expressiveness of query languages. Based on fuzzy set theory, flexible querying enables users to express preferences inside requirements. Quantifications and preferences on data have led us to define the notion of gradual integers (Nf). This framework has been extended to Zf and Qf, in order to dealing with queries based on difference or divisi...
متن کاملProject-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Algebra-based identification of tree patterns in XQuery p. 13 Approximate querying of XML fuzzy data p. 26 Relaxation paradigm in a flexible querying context p. 39 A functional model for data analysis p. 51 Materialization-based range and k-nearest neighbor query processing algorithms p. 65 Flexible querying using structural and event based multimodal video data model p. 75 Reverse nearest neig...
متن کاملBiological relation extraction and query answering from MEDLINE abstracts using ontology-based text mining
The rapid growth of the biological text data repository makes it difficult for human beings to access required information in a convenient and effective manner. The problem arises due to the fact that most of the information is embedded within unstructured or semi-structured text that computers can not interpret very easily. In this paper we have presented an ontology-based Biological Informati...
متن کاملFuzzy data mining of term associations for flexible query answering
We present an approach to data mine a document base for term associations that are useful for query expansion in flexible query answering. Fuzzy logic and probability theory are applied to handle key aspects of uncertainty arising from vagueness of terms and randomness of term occurrence. In particular, we consider conditional probability to increase the utility of association, Chebyshev's ineq...
متن کامل